Optimal Retiming for Initial State Computation
نویسندگان
چکیده
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state for the retimed circuit. In this paper we propose a new efficient retiming algorithm for performance optimization. The retiming determined by the algorithm is the best with respect to initial state computation. It is the easiest retiming for finding an equivalent initial state, and if logic modification is required, it incurs the minimum amount of modification.
منابع مشابه
Optimal FPGA Mapping and Retiming with E cient Initial State Computation
For sequential circuits with given initial states, new equivalent initial states must be computed for retiming, which unfortunately is NP-hard. In this paper we propose a novel polynomial time algorithm for optimal FPGA mapping with forward retiming to minimize the clock period with guaranteed initial state computation. It enables a new methodology of separating forward retiming from backward r...
متن کاملOptimal Fpga Mapping and Retiming with Eecient Initial State Computation
E cient Initial State Computation Jason Cong and Chang Wu Department of Computer Science University of California, Los Angeles, CA 90095 Abstract For sequential circuits with given initial states, new equivalent initial states must be computed for retiming, which unfortunately is NP-hard. In this paper we propose a novel polynomial time algorithm for optimal FPGA mapping with forward retiming t...
متن کاملSchedule - Based Multi - Dimensional Retiming on DataFlow
Transformation techniques are usually applied to get optimal execution rates in parallel and/or pipeline systems. The retiming technique is a common and valuable tool in one-dimensional problems, represented by Data Flow Graphs (DFGs) such as DSP lters, which can maximize the parallelism of a loop body represented by a DFG. Since most scientiic or DSP applications are recursive or iterative, to...
متن کاملA novel framework for retiming using evolutionary computation for high level synthesis of digital filters
In this paper, design of a new algorithm and a framework for retiming the DSP blocks based on evolutionary computation process is explained. Optimal DSP blocks such as digital filter design is a high level synthesis problem which includes optimally mapping digital filter specifications on to FPGA (Field Programmable Gate Array) architecture. Retiming is the considered optimization method in thi...
متن کاملCombining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). The execution of all tasks of a DFG is called an iteration, with the average computation time of an iteration the iteration period. A great deal of research has been done attempting to optimize such applicatio...
متن کامل